Positive association of the oriented percolation cluster in randomly oriented graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Positive association of the oriented percolation cluster in randomly oriented graphs

Consider any fixed graph whose edges have been randomly and independently oriented, and write {S i} to indicate that there is an oriented path going from a vertex s ∈ S to vertex i. Narayanan (2016) proved that for any set S and any two vertices i and j, {S i} and {S j} are positively correlated. His proof relies on the Ahlswede-Daykin inequality, a rather advanced tool of probabilistic combina...

متن کامل

Connections in Randomly Oriented Graphs

Given an undirected graph G, let us randomly orient G by tossing independent (possibly biased) coins, one for each edge of G. Writing a→ b for the event that there exists a directed path from a vertex a to a vertex b in such a random orientation, we prove that for any three vertices s, a and b of G, we have P(s→ a ∩ s→ b) ≥ P(s→ a)P(s→ b).

متن کامل

New skew equienergetic oriented graphs

Let $S(G^{sigma})$ be the skew-adjacency matrix of the oriented graph $G^{sigma}$, which is obtained from a simple undirected graph $G$ by assigning an orientation $sigma$ to each of its edges. The skew energy of an oriented graph $G^{sigma}$ is defined as the sum of absolute values of all eigenvalues of $S(G^{sigma})$. Two oriented graphs are said to be skew equienergetic iftheir skew energies...

متن کامل

Continuum percolation for randomly oriented soft-core prisms.

We study continuum percolation of three-dimensional randomly oriented soft-core polyhedra (prisms). The prisms are biaxial or triaxial and range in aspect ratio over six orders of magnitude. Results for prisms are compared with studies for ellipsoids, rods, ellipses, and polygons and differences are explained using the concept of the average excluded volume, . For large-shape anisotropie...

متن کامل

A Note on Correlations in Randomly Oriented Graphs

Given a graph G, we consider the model where G is given a random orientation by giving each edge a random direction. It is proven that for a, b, s ∈ V (G), the events {s → a} and {s → b} are positively correlated. This correlation persists, perhaps unexpectedly, also if we first condition on {s 9 t} for any vertex t 6= s. With this conditioning it is also true that {s → b} and {a → t} are negat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorics, Probability and Computing

سال: 2019

ISSN: 0963-5483,1469-2163

DOI: 10.1017/s0963548319000191